Introduction to Lattice Theory
نویسنده
چکیده
A lattice is defined as an algebra on a nonempty set with binary operations join and meet which are commutative and associative, and satisfy the absorption identities. The following kinds of lattices are considered: distributive, modular, bounded (with zero and unit elements), complemented, and Boolean (with complement). The article includes also theorems which immediately follow from definitions.
منابع مشابه
Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کاملسیستمهای الکترونی همبسته قوی در شبکههای ناکام
We give an overview of recent work on charge degrees of freedom of strongly correlated electrons on geometrically frustrated lattices. Special attention is paid to the checkerboard lattice, i.e., the two-dimensional version of a pyrochlore lattice and to the kagomé lattice. For the checkerboard lattice it is shown that at half filling when spin degrees of freedom are neglected and at quarter f...
متن کاملA dynamic lattice model for heterogeneous materials
In this paper, the mechanical behavior of three-phase inhomogeneous materials is modeled using the meso-scale model with lattice beams for static and dynamic analyses. The Timoshenko beam theory is applied instead of the classical Euler-Bernoulli beam theory and the mechanical properties of lattice beam connection are derived based on the continuum medium using the non-local continuum theory. T...
متن کاملA Novel Image Encryption Model Based on Hybridization of Genetic Algorithm, Chaos Theory and Lattice Map
Encryption is an important issue in information security which is usually provided using a reversible mathematical model. Digital image as a most frequently used digital product needs special encryption algorithms. This paper presents a new encryption algorithm high security for digital gray images using genetic algorithm and Lattice Map function. At the first the initial value of Logistic Map ...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملLiquid Density Modeling of Pure Refrigerants Using Four Lattice-Hole Theory Based Equations of State
The present study investigates the performance and relative accuracy of four lattice-hole theory based equations of state in modeling and correlating the liquid density of pure refrigerants. Following the gathering of a database of 5740 experimental liquid density datapoints of 36 pure refrigerants belonging to five different categories including CFCs, HCFCs, PFCs, HFCs and HFEs, ranging from 6...
متن کامل